A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
نویسندگان
چکیده
منابع مشابه
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
We study the problem of scheduling n preemptable jobs in a two-machine flow shop where the first machine is not available for processing during a given time interval. The objective is to minimize the makespan. We propose a polynomialtime approximation scheme for this problem. The approach is extended to solve the problem in which the second machine is not continuously available.
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملA polynomial time approximation scheme for the MRCT problem∗
The ratio achieves its minimum when the two terms coincide, i.e., δ = 1/4, and the minimum ratio is 4/3. In fact, by using a general star and a (1/4)-separator, it is possible to approximate an MRCT with ratio (4/3) + ε for any constant ε > 0 in polynomial time. The additional error ε is due to the difference between the guessed and the true separators. By this strategy, the approximation ratio...
متن کاملA Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of n items and m bins (knapsacks) such that each item i has a profit p(i) and a size s(i), and each bin j has a capacity c(j). The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is...
متن کاملA Polynomial-Time Approximation Scheme for The Airplane Refueling Problem
We study the airplane refueling problem which was introduced by the physicists Gamow and Stern in their classical book Puzzle-Math (1958). Sticking to the original story behind this problem, suppose we have to deliver a bomb in some distant point of the globe, the distance being much greater than the range of any individual airplane at our disposal. Therefore, the only feasible option to carry ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00157-1